Quantitative Evaluation of Job and Resources for Better Selection to Improve makespan in Grid Scheduling
نویسندگان
چکیده
This study presents the Priority based ranking of jobs and resources to improve the Makespan in the grid scheduling problem. Grid environment’s effectiveness largely depends on scheduler’s effectiveness/efficiency as they act as local resource brokers. The scheduler is responsible to select resources/scheduling jobs so that users/application requirements are met regarding overall execution time (throughput) and the resources use cost. The scheduler selects resources that suit user imposed constraints/conditions like CPU usage, RAM available/disk storage. Resource/Jobs are selected using WPR algorithm which improves in performance like Makespan. Results are compared with Round Robin/Weighted Round Robin algorithms where the proposed method has better performance.
منابع مشابه
An Optimal Job Scheduling Algorithm in Computational Grids
Grid computing is an emerging technology that involves coordinating and sharing of resources to carry out complex computational problems. Resource management and scheduling plays a crucial role in achieving high utilization of resources in grid computing environments. Due to heterogeneity of resources, scheduling an application is significantly complicated and challenging task in grid system. M...
متن کاملEvaluating Heuristics for Scheduling Dependent Jobs in Grid Computing Environments
Job scheduling plays a critical role in the utilisation of grid resources by mapping a number of jobs to grid resources. However, the heterogeneity of grid resources adds some challenges to the work of job scheduling, especially when jobs have dependencies which can be represented as Direct Acyclic Graphs (DAGs). It is widely recognised that scheduling m jobs to n resources with an objective to...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملTask Scheduling Using Particle Swarm Optimization Algorithm with a Selection Guide and a Measure of Uniformity for Computational Grids
In this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the Selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. Scheduling algorithms play an important role in grid computing, parallel tasks Scheduling and sending them to ...
متن کاملAn Efficient Hybrid Job Scheduling Algorithm for Computational Grids
Scheduling of jobs is a challenging problem in grid. Efficient job scheduling is essential for the effective utilization of the resources. We propose a grid model as a collection of clusters. In this paper, we apply Divisible Load Theory (DLT) and Least Cost Method (LCM) to model the grid scheduling problem involving multiple worker nodes in each cluster. We propose a hybrid job scheduling algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JCS
دوره 10 شماره
صفحات -
تاریخ انتشار 2014